A consistency result on weak re ectionJames
نویسندگان
چکیده
In this paper we study the notion of strong non-reeection, and its contrapositive weak reeection. We say strongly non-reeects at ii there is a function F : ! such that for all < with cf() = there is C club in such that F C is strictly increasing. We prove that it is consistent to have a cardinal such that strong non-reeection and weak reeection each hold on an unbounded set of cardinals less than .
منابع مشابه
Can Expensive Synchronization be Avoided in Weak Memory Models? (Brief Announcement)
Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern shared-memory systems present a large variety of ordering constraints on memory accesses that are much weaker than sequential consistency. We re-addressed two fundamental process coordination problems in the context of weak memory models. We proved that many models cannot supp...
متن کاملWeak Memory Consistency Models
Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern multiprocessors present a large variety of memory models that are anything but sequentially consistent. In these machines, the ordering constraints on memory accesses are few. We re-address two fundamental process coordination problems in the context of weak memory models. We ...
متن کاملHamming Embedding and Weak Geometric Consistency for Large Scale Image Search
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the sub-optimality of such a representation for matching descriptors and leads us to derive a more precise representation based on 1) Hamming embedding (...
متن کاملInstance Search with Weak Geometric Correlation Consistency
Finding object instances from large image collections is a challenging problem with many practical applications. Recent methods inspired by text retrieval achieved good results; however a re-ranking stage based on spatial verification is still required to boost performance. To improve the effectiveness of such instance retrieval systems while avoiding the computational complexity of a re-rankin...
متن کاملLouvre: Light-weight Ordering Using Versioning for Release Consistency
Fence instructions are fundamental primitives that ensure consistency in a weakly consistent shared memory multicore processor. The execution cost of these instructions is significant and adds a non-trivial overhead to parallel programs. In a naı́ve architecture implementation, we track the ordering constraints imposed by a fence by its entry in the reorder buffer and its execution overhead enta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998